Succinct balanced binary tree and packed memory structure
نویسنده
چکیده
Binary search trees are one of the oldest and most common dictionary data structures. The most common implementation of a binary tree uses two pointers in each node to point to the children. This representation however suffers from significant multiplicative overhead for storage of data. Each datum incurs an overhead of two pointers. In common programming languages, where each node is represented by a fixed size record, the pointer fields of all the leaf records are also wasted.
منابع مشابه
Dynamizing Succinct Tree Representations
We consider succinct, or space-efficient, representations of ordinal trees. Representations exist that take 2n+ o(n) bits to represent a static n-node ordinal tree – close to the information-theoretic minimum – and support navigational operations in O(1) time on a RAM model; and some implementations have good practical performance. The situation is different for dynamic ordinal trees. Although ...
متن کاملSuccinct Representation of Balanced Parentheses, Static Trees and Planar Graphs
We consider the implementation of abstract data types for the static objects: binary tree, rooted ordered tree and balanced parenthesis expression. Our representations use an amount of space within a lower order term of the information theoretic minimum and support, in constant time, a richer set of navigational operations than has previously been considered in similar work. In the case of bina...
متن کاملSuccinct Set-Encoding for State-Space Search
We introduce the level-ordered edge sequence (LOES), a succinct encoding for state-sets based on prefix-trees. For use in state-space search, we give algorithms for member testing and element hashing with runtime dependent only on state size, as well as time and memory efficient construction of and iteration over such sets. Finally we compare LOES to binary decision diagrams (BDDs) and explicit...
متن کاملImplementing a Dynamic Compressed Trie
We present an order-preserving general purpose data structure for binary data, the LPC-trie. The structure is a highly compressed trie, using both level and path compression. The memory usage is similar to that of a balanced binary search tree, but the expected average depth is smaller. The LPC-trie is well suited to modern language environments with eecient memory allocation and garbage collec...
متن کاملA Simple Optimal Representation for Balanced Parentheses
We consider succinct, or highly space-efficient, representations of a (static) string consisting of n pairs of balanced parentheses, that support natural operations such as finding the matching parenthesis for a given parenthesis, or finding the pair of parentheses that most tightly enclose a given pair. This problem was considered by Jacobson, [Proc. 30th FOCS, 549–554, 1989] and Munro and Ram...
متن کامل